On the Generalized Nullspace of M-Matrlces and Z-Matrices*
نویسندگان
چکیده
A proof is given for the preferred basis theorem for the generalized nullspace of a given M-matrix. The theorem is then generalized and extended to the case of a Z-matrix.
منابع مشابه
Characterizations and Classifications of M-Matrlces Using Generalized Nullspaces
Several characterizations of the class of M-matrices as a subclass of the class of Z-matrices are given. These characterizations involve alternating sequences, decompositions, and splittings, and all are related to generalized nullspaces.
متن کاملGeneralized Drazin inverse of certain block matrices in Banach algebras
Several representations of the generalized Drazin inverse of an anti-triangular block matrix in Banach algebra are given in terms of the generalized Banachiewicz--Schur form.
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملOn the fine spectrum of generalized upper triangular double-band matrices $Delta^{uv}$ over the sequence spaces $c_o$ and $c$
The main purpose of this paper is to determine the fine spectrum of the generalized upper triangular double-band matrices uv over the sequence spaces c0 and c. These results are more general than the spectrum of upper triangular double-band matrices of Karakaya and Altun[V. Karakaya, M. Altun, Fine spectra of upper triangular doubleband matrices, Journal of Computational and Applied Mathematics...
متن کاملOn the computation of the nullspace of Toeplitz–like matrices
The knowledge of the nullspace and its size of some structured matrices, like Hankel and Toeplitz matrices, is important in many applications arising in system theory. In this paper we describe an algorithm to compute the kernel of Toeplitz and Hankel matrices based on the generalized Schur algorithm.
متن کامل